Tracking using Numerous Anchor Points
نویسندگان
چکیده
منابع مشابه
Optic Flow Using Multi-scale Anchor Points
We introduce a new method to determine the flow field of an image sequence using multi-scale anchor points. These anchor points manifest themselves in the scale-space representation of an image. The novelty of our method lies largely in the fact that the relation between the scale-space anchor points and the flow field is formulated in terms of soft constraints in a variational method. This lea...
متن کاملAnchor points in DEA
Anchor points play an important role in DEA theory and application. They define the transition from the efficient frontier to the “free-disposability” portion of the boundary. Our objective is to use the geometrical properties of anchor points to design and test an algorithm for their identification. We focus on the variable returns to scale production possibility set; our results do not depend...
متن کاملOn Reversible Skeletonization Using Anchor-Points from Distance Transforms
In many applications thinning of objects is of great interest. We here present a skeletonization algorithm that is based on the idea of iteratively thinning the distance transform of an object layer by layer until either an anchor-point is reached or the connectivity breaks. Our algorithm is general in the sense that any metric and any connectivity can be used. Also, it is based on ideas that a...
متن کاملAnchor-Points Algorithms for Hamming and Edit Distances Using MapReduce
Algorithms for computing similarity joins in MapReduce were offered in [2]. Similarity joins ask to find input pairs that are within a certain distance d according to some distance measure. Here we explore the “anchor-points algorithm” of [2]. We continue looking at Hamming distance, and show that the method of that paper can be improved; in particular, if we want to find strings within Hamming...
متن کاملMultiple sequence alignment using anchor points through generalized dynamic programming
A generalization of the dynamic programming algorithm applied to the multiple alignment of protein sequences is proposed. The algorithm has two main procedures: (i) local correspondences between sequences hereafter called anchor points are selected according to a criterion that combines local and global simlilarity values, (ii) the alignment is constructed recursively by choosing and linking to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Vision and Applications
سال: 2017
ISSN: 0932-8092,1432-1769
DOI: 10.1007/s00138-017-0898-3